Fault Tolerant Partition Resolvability in Convex Polytopes

Convex polytopes are special types of having an additional property that they also convex sets in the n-dimensional Euclidean space. The polytope topologies being used antitracking networks due to their stability, resilience, and destroy-resistance. metric related parameters have been extensively studied recent times applications several areas including robot navigation, network designing, image processing, chemistry. In this article, sharp bounds for fault tolerant partition dimension certain well-known families Rn, Qn, Sn, Tn, Dn computed. Furthermore, we graphs bounded below by 4.